أدخل كلمة أو عبارة بأي لغة 👆
اللغة:
ترجمة وتحليل الكلمات بواسطة الذكاء الاصطناعي
في هذه الصفحة يمكنك الحصول على تحليل مفصل لكلمة أو عبارة باستخدام أفضل تقنيات الذكاء الاصطناعي المتوفرة اليوم:
- كيف يتم استخدام الكلمة في اللغة
- تردد الكلمة
- ما إذا كانت الكلمة تستخدم في كثير من الأحيان في اللغة المنطوقة أو المكتوبة
- خيارات الترجمة إلى الروسية أو الإسبانية، على التوالي
- أمثلة على استخدام الكلمة (عدة عبارات مع الترجمة)
- أصل الكلمة
%ما هو (من)٪ 1 - تعريف
CLASS OF MATHEMATICAL PROBLEMS CONCERNED WITH CHOOSING AN OPTIMAL TIME TO TAKE A PARTICULAR ACTION
Optimal Stopping; Optimal Stopping problem
Optimal job scheduling
Graham notation; Notation for theoretic scheduling problems
Optimal job scheduling is a class of optimization problems related to scheduling. The inputs to such problems are a list of jobs (also called processes or tasks) and a list of machines (also called processors or workers).
Scheduling Open Service Interface Definition
AN OPEN KNOWLEDGE INITIATIVE SPECIFICATION; PROGRAMMATIC INTERFACES WHICH COMPRISE A SERVICE-ORIENTED ARCHITECTURE FOR DESIGNING AND BUILDING REUSABLE AND INTEROPERABLE SOFTWARE
Scheduling OSID
The Scheduling Open Service Interface Definition (OSID) is an Open Knowledge Initiative specification. OSIDs are programmatic interfaces which comprise a service-oriented architecture for designing and building reusable and interoperable software.
Job-shop scheduling
BRANCH OF DISCRETE MATHEMATICS
Job-shop problem; Job shop scheduling; Job Shop Scheduling
Job-shop scheduling, the job-shop problem (JSP) or job-shop scheduling problem (JSSP) is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling.
ويكيبيديا
Optimal stopping
In mathematics, the theory of optimal stopping or early stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. Optimal stopping problems can be found in areas of statistics, economics, and mathematical finance (related to the pricing of American options). A key example of an optimal stopping problem is the secretary problem. Optimal stopping problems can often be written in the form of a Bellman equation, and are therefore often solved using dynamic programming.
